2 : Forbidden Paths and Cycles
نویسنده
چکیده
Recall that in extremal graph theory, we would like to answer questions of the following sort: ‘What is the maximum/minimum possible parameter C among graphs satisfying a certain property P?’ In the last lecture, we see Mantel’s theorem, which answers the above question with the parameter being the number of edges and the property being triangle-free. In this lecture, we will be looking at other interesting parameters and properties.
منابع مشابه
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected graph G satisfies the above conditions, then G is hamiltonian. In this paper, modifying the conditions of Duffus et al.’s theorems, we give forbidden structures for a specified set of vertices which assures the existe...
متن کاملFinding a Path in Group-Labeled Graphs with Two Labels Forbidden
The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to the label constraints in a group-labeled graph, which is a directed graph with a group label on each arc. Recently, paths and cycles in group-labeled graphs have been investigated, such as finding non-zero disjoint paths a...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملHelly $\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition
The edge intersection graph of a family of paths in host tree is called an EPT graph. When the host tree has maximum degree h, we say that G belongs to the class [h, 2, 2]. If, in addition, the family of paths satisfies the Helly property, then G ∈ Helly [h, 2, 2]. The time complexity of the recognition of the classes [h, 2, 2] inside the class EPT is open for every h > 4. In [6], Golumbic et a...
متن کاملGraph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
We introduce an analysis method that checks for the absence of (Euler) paths or cycles in the set of graphs reachable from a start graph via graph transformation rules. This technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. An important application is deadlock analysis in distributed systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016